Search results for "Function problem"
showing 2 items of 2 documents
Composition operators on the Schwartz space
2018
[EN] We study composition operators on the Schwartz space of rapidly decreasing functions. We prove that such a composition operator is never a compact operator and we obtain necessary or sufficient conditions for the range of the composition operator to be closed. These conditions are expressed in terms of multipliers for the Schwartz class and the closed range property of the corresponding operator considered in the space of smooth functions.
Some Computational Aspects of DISTANCE-SAT
2007
In many AI fields, one must face the problem of finding a solution that is as close as possible to a given configuration. This paper addresses this problem in a propositional framework. We introduce the decision problem distance-sat, which consists in determining whether a propositional formula admits a model that disagrees with a given partial interpretation on at most d variables. The complexity of distance-sat and of several restrictions of it are identified. Two algorithms based on the well-known Davis/Logemann/Loveland search procedure for the satisfiability problem sat are presented so as to solve distance-sat for CNF formulas. Their computational behaviors are compared with the ones …